A Screening Technique for Joint Chance-Constrained Programming for Air-Quality Management
نویسندگان
چکیده
منابع مشابه
SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملJoint Chance Constrained Programming for Hydro Reservoir Management
In this paper, we deal with a hydraulic reservoir optimization problem with uncertainty on inflows in a joint chance constrained programming setting. In particular, we will consider inflows with a persistency effect, following a causal time series model, and examine the impact of the ”Gaussian” assumption for such inflows. We present an iterative algorithm for solving similarly structured joint...
متن کاملsome properties for fuzzy chance constrained programming
convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملStrong Inequalities for Chance–Constrained Programming
As an essential substructure underlying a large class of chance-constrained programming problems with finite discrete distributions, the mixing set with 0 − 1 knapsack has received considerable attentions in recent literature. In this study, we present a family of strong inequalities that subsume known inequalities for this set. We also find many other inequalities that can be explained by lift...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2007
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1060.0377